An Attribute Involved Public Key Cryptosystem Based on P-Sylow Subgroups and Randomization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improvement on Shimada's Public-Key Cryptosystem

The difficulty of breaking Rabin's cryptosystem is the same as that of factoring its public key. So far, this has been proven to be very difficult. However the disadvantage of Rabin's cryptosystem is that the deciphering function cannot produce a unique plaintext. Many modified Rabin's cryptosystems have been proposed. Recently, an excellent scheme modified from Rabin's cryptosystem has been pr...

متن کامل

Public-Key Cryptosystem Based on Isogenies

A new general mathematical problem, suitable for publickey cryptosystems, is proposed: morphism computation in a category of Abelian groups. In connection with elliptic curves over finite fields, the problem becomes the following: compute an isogeny (an algebraic homomorphism) between the elliptic curves given. The problem seems to be hard for solving with a quantum computer. ElGamal public-key...

متن کامل

An Applicable Public-Key-Cryptosystem Based on NP-Complete Problems

The proposed PKC has two main advantages that will make it applicable to the real world. The first one is a decoding algorithm with an expected runtime of O(n) elementary operations. The second advantage is that the corresponding matrix A is of the form A = [A′ | I], where I is the identity matrix and A′ being completely random, in contrast to e.g. McEliece-Type systems (cf. [1]), which means t...

متن کامل

On DRSA Public Key Cryptosystem

The standard RSA cryptosystem is not semantically secure. Pointcheviel proposed a variant of RSA cryptosystem with the property of semantic security by introducing a new problem known as DRSA problem. He called it DRSA scheme. In this paper, we underlined a shortcoming of that scheme and proposed an alternative DRSA public key cryptosystem.

متن کامل

On Oleshchuk's Public Key Cryptosystem

This paper revisits a public key cryptosystem which is based on finite Church-Rosser string-rewriting systems. We consider some ideas for cryptanalysis and discuss issues concerning practical usage. It turns out that without changing crucial details of key generation this cryptosystem does not offer acceptable cryptographic security. We also provide the source code of our rudimentary implementa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Computer Science & Mathematics

سال: 2018

ISSN: 2066-4273,2066-3129

DOI: 10.4316/jacsm.201801005